Pairing - friendly Hyperelliptic Curves of Type y 2 = x 5 + ax

نویسندگان

  • Mitsuru Kawazoe
  • Tetsuya Takahashi
چکیده

An explicit construction of pairing-friendly hyperelliptic curves with ordinary Jacobians was firstly given by D. Freeman. In this paper, we give other explicit constructions of pairing-friendly hyperelliptic curves. Our methods are based on the closed formulae for the order of the Jacobian of a hyperelliptic curve of type y = x + ax over a finite prime field Fp which are given by E. Furukawa, M. Haneda, M. Kawazoe and T. Takahashi. We present two methods in this paper. One is an analogue of the Cocks-Pinch method and the other is a cyclotomic method. Our methods construct a pairing-friendly hyperelliptic curve y = x + ax over Fp whose Jacobian has a prescribed embedding degree with respect to some prime number `. Curves constructed by the analogue of the Cocks-Pinch method satisfy p ≈ `, whereas p ≈ ` in Freeman’s construction. Moreover, for the case of embedding degree 24, we can construct a cyclotomic family with p ≈ `.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y2=x5ax

An explicit construction of pairing-friendly hyperelliptic curves with ordinary Jacobians was firstly given by D. Freeman. In this paper, we give other explicit constructions of pairing-friendly hyperelliptic curves with ordinary Jacobians based on the closed formulae for the order of the Jacobian of a hyperelliptic curve of type y = x + ax. We present two methods in this paper. One is an analo...

متن کامل

Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions

The use of elliptic and hyperelliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test whether the Jacobian – over a finite field Fq – of a hyperelliptic curve of the form Y 2 = X + aX + bX (with a, b ∈ Fq) has a large prime factor. His approach is to obtain candidates for the ...

متن کامل

Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves

Constructing pairing-friendly hyperelliptic curves with small ρ-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe a method that extends the Kawazoe-Takahashi method of generating families of genus 2 ordinary pairing-friendly hyperelliptic curves by parameterizing the parameters as polynomials. With this approach we construct genu...

متن کامل

Constructing Pairing-Friendly Genus 2 Curves with Split Jacobian

Genus 2 curves with simple but not absolutely simple jacobians can be used to construct pairing-based cryptosystems more efficient than for a generic genus 2 curve. We show that there is a full analogy between methods for constructing ordinary pairing-friendly elliptic curves and simple abelian varieties, which are iogenous over some extension to a product of elliptic curves. We extend the noti...

متن کامل

Counting Points for Hyperelliptic Curves of Type y2= x5 + ax over Finite Prime Fields

Counting rational points on Jacobian varieties of hyperelliptic curves over finite fields is very important for constructing hyperelliptic curve cryptosystems (HCC), but known algorithms for general curves over given large prime fields need very long running times. In this article, we propose an extremely fast point counting algorithm for hyperelliptic curves of type y = x + ax over given large...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008